- Home
- Search Results
- Page 1 of 1
Search for: All records
-
Total Resources3
- Resource Type
-
0000000003000000
- More
- Availability
-
30
- Author / Contributor
- Filter by Author / Creator
-
-
Goh, Jun Le (2)
-
Dzhafarov, Damir D. (1)
-
GOH, JUN LE (1)
-
Hirschfeldt, Denis R. (1)
-
KALIMULLIN, ISKANDER SH. (1)
-
Lempp, Steffen (1)
-
MILLER, JOSEPH S. (1)
-
Ng, Keng Meng (1)
-
Patey, Ludovic (1)
-
Pauly, Arno (1)
-
SOSKOVA, MARIYA I. (1)
-
Soskova, Mariya I. (1)
-
#Tyler Phillips, Kenneth E. (0)
-
#Willis, Ciara (0)
-
& Abreu-Ramos, E. D. (0)
-
& Abramson, C. I. (0)
-
& Abreu-Ramos, E. D. (0)
-
& Adams, S.G. (0)
-
& Ahmed, K. (0)
-
& Ahmed, Khadija. (0)
-
- Filter by Editor
-
-
Brattka, Vasco (1)
-
Greenberg, Noam (1)
-
Kalimullin, Iskander (1)
-
Soskova, Mariya (1)
-
& Spizer, S. M. (0)
-
& . Spizer, S. (0)
-
& Ahn, J. (0)
-
& Bateiha, S. (0)
-
& Bosch, N. (0)
-
& Brennan K. (0)
-
& Brennan, K. (0)
-
& Chen, B. (0)
-
& Chen, Bodong (0)
-
& Drown, S. (0)
-
& Ferretti, F. (0)
-
& Higgins, A. (0)
-
& J. Peters (0)
-
& Kali, Y. (0)
-
& Ruiz-Arias, P.M. (0)
-
& S. Spitzer (0)
-
-
Have feedback or suggestions for a way to improve these results?
!
Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher.
Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?
Some links on this page may take you to non-federal websites. Their policies may differ from this site.
-
Brattka, Vasco; Greenberg, Noam; Kalimullin, Iskander; Soskova, Mariya (Ed.)In her 1990 thesis, Ahmad showed that there is a so-called “Ahmad pair”, i.e., there are incomparable Σ 2 0 -enumeration degrees a 0 and a 1 such that every enumeration degree x < a 0 is ⩽ a 1 . At the same time, she also showed that there is no “symmetric Ahmad pair”, i.e., there are no incomparable Σ 2 0 -enumeration degrees a 0 and a 1 such that every enumeration degree x 0 < a 0 is ⩽ a 1 and such that every enumeration degree x 1 < a 1 is ⩽ a 0 . In this paper, we first present a direct proof of Ahmad’s second result. We then show that her first result cannot be extended to an “Ahmad triple”, i.e., there are no Σ 2 0 -enumeration degrees a 0 , a 1 and a 2 such that both ( a 0 , a 1 ) and ( a 1 , a 2 ) are an Ahmad pair. On the other hand, there is a “weak Ahmad triple”, i.e., there are pairwise incomparable Σ 2 0 -enumeration degrees a 0 , a 1 and a 2 such that every enumeration degree x < a 0 is also ⩽ a 1 or ⩽ a 2 ; however neither ( a 0 , a 1 ) nor ( a 0 , a 2 ) is an Ahmad pair.more » « less
-
GOH, JUN LE; KALIMULLIN, ISKANDER SH.; MILLER, JOSEPH S.; SOSKOVA, MARIYA I. (, The Journal of Symbolic Logic)Abstract Recall that B is PA relative to A if B computes a member of every nonempty $$\Pi ^0_1(A)$$ class. This two-place relation is invariant under Turing equivalence and so can be thought of as a binary relation on Turing degrees. Miller and Soskova [23] introduced the notion of a $$\Pi ^0_1$$ class relative to an enumeration oracle A , which they called a $$\Pi ^0_1{\left \langle {A}\right \rangle }$$ class. We study the induced extension of the relation B is PA relative to A to enumeration oracles and hence enumeration degrees. We isolate several classes of enumeration degrees based on their behavior with respect to this relation: the PA bounded degrees, the degrees that have a universal class, the low for PA degrees, and the $${\left \langle {\text {self}\kern1pt}\right \rangle }$$ -PA degrees. We study the relationship between these classes and other known classes of enumeration degrees. We also investigate a group of classes of enumeration degrees that were introduced by Kalimullin and Puzarenko [14] based on properties that are commonly studied in descriptive set theory. As part of this investigation, we give characterizations of three of their classes in terms of a special sub-collection of relativized $$\Pi ^0_1$$ classes—the separating classes. These three can then be seen to be direct analogues of three of our classes. We completely determine the relative position of all classes in question.more » « less
-
Dzhafarov, Damir D.; Goh, Jun Le; Hirschfeldt, Denis R.; Patey, Ludovic; Pauly, Arno (, Computability)
An official website of the United States government
